dijkstra_search

Locates the next node in graph to get to a position Uses Dijkstra search algorithm

deprecated("Killing")

void

dijkstra_search

(

T

U

)

(

GridWithWeights graph

,

,

,

out T[T] came_from

,

out U[T] cost_so_far

)

Parameters

graph: Type: GridWithWeights
The graph of nodes
start: Type: T
Starting position to go to
goal: Type: T
The end position
came_from: Type: T[T]
The positions between start and end
cost_so_far: Type: U[T]
Sum of weights (cost) to get to goal from start

Meta

Source

See Implementation

devisualization util algorithms pathfinding dijkstra modules